Logic Programming for Non-Monotonic Reasoning
نویسندگان
چکیده
Our purpose is to exhibit a modular systematic method of representing nonmonotonic reasoning problems with the Well Founded Semantics of extended logic programs aumented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We show how to cast in the language of such logic programs forms of non-monotonic reasoning like defeasible reasoning and hypothetical reasoning and apply them to diierent domains of knowledge representation , for instance hierarchies and reasoning about actions. We then abstract a modular systematic method of representing non-monotonic problems in logic programming.
منابع مشابه
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and reenes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-monotonic consequence of a theory if it can be derived monotonically from a theory extended by means of acceptable assumptions. The notion of acceptability for such assumptions is formulated in terms of their ability succ...
متن کاملG’3-Stable Semantics and Inconsistency Semantica G3'-Estable e Inconsistencia
We present an overview on how to perform non-monotonic reasoning based on paraconsistent logics. In particular, we show that one can define a logic programming semantics based on the paraconsistent logic G’3 which is called G’3-stable semantics. This semantics defines a frame for performing non-monotonic reasoning in domains which are pervaded with vagueness and inconsistencies. In fact, we sho...
متن کاملA Hybrid Approach to Inference in Probabilistic Non-Monotonic Logic Programming
We present a probabilistic inductive logic programming framework which integrates non-monotonic reasoning, probabilistic inference and parameter learning. In contrast to traditional approaches to probabilistic Answer Set Programming (ASP), our framework imposes only comparatively little restrictions on probabilistic logic programs in particular, it allows for ASP as well as FOL syntax, and for ...
متن کاملArgumentation and Answer Set Programming
Argumentation and answer set programming are the two main knowledge representation paradigms emerged from logic programming for non-monotonic reasoning. This paper surveys recent work on using answer set programming as a mechanism for computing extensions in argumentation. The paper also indicates some directions for future work.
متن کاملNon-Monotonic Reasoning with Logic Programming
Our purpose is to exhibit a modular systematic method of representing non{ monotonic reasoning problems with the Well Founded Semantics WFS of extended logic programs augmented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We apply this semantics, and its contradiction removal semantics counterpart, to represent non-monotonic reasoning probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992